Enumeration of cubic lattice walks by contact class
نویسنده
چکیده
Self-avoiding walks on a three-dimensional ~3D! simple cubic lattice are often used to model polymers, especially proteins. The Hamiltonian is generally taken to be a function of contacts between sequentially nonadjacent residues. The set of all conformations having a particular set of contacts occupies the same energy level, and one would like to estimate the degeneracy or chain entropy of the level. Degeneracies observed in an exhaustive enumeration of short chain configurations are fitted to simple empirical formulas depending on the length of the chain, the number of contacts, and statistics related to the particular set of contacts. © 2000 American Institute of Physics. @S0021-9606~00!51524-4#
منابع مشابه
Exact enumeration of three-dimensional lattice proteins
We present an algorithm for the exhaustive enumeration of all monomer sequences and conformations of short lattice proteins as described by the hydrophobic–polar (HP) model. The algorithm is used for an exact identification of all designing sequences of HP proteins consisting of up to 19 monomers whose conformations are represented by interacting self–avoiding walks on the simple cubic lattice....
متن کاملSpiral Trees on Hyper - cubic lattices
We study rooted spiral trees in 2, 3 and 4 dimensions on a hyper cubic lattice using exact enumeration and Monte-Carlo techniques. On the square lattice, we also obtain exact lower bound of 1.93565 on the growth constant λ. Series expansions give θ = −1.3667± 0.0010 and ν = 0.6574± 0.0010 on a square lattice. With Monte-Carlo simulations we get the estimates as θ = −1.364±0.010, and ν = 0.656±0...
متن کاملSquare lattice walks avoiding a quadrant
In the past decade, a lot of attention has been devoted to the enumeration of walks with prescribed steps confined to a convex cone. In two dimensions, this means counting walks in the first quadrant of the plane (possibly after a linear transformation). But what about walks in non-convex cones? We investigate the two most natural cases: first, square lattice walks avoiding the negative quadran...
متن کاملSelf-avoiding walks and polygons on quasiperiodic tilings
We enumerate self-avoiding walks and polygons, counted by perimeter, on the quasiperiodic rhombic Penrose and Ammann-Beenker tilings, thereby considerably extending previous results. In contrast to similar problems on regular lattices, these numbers depend on the chosen initial vertex. We compare different ways of counting and demonstrate that suitable averaging improves convergence to the asym...
متن کاملAnalytic Combinatorics of Lattice Paths: Enumeration and Asymptotics for the Average Area†
This paper tackles the enumeration and asymptotics of the area below directed lattice paths (walks on N, with a finite set of jumps). It is a nice surprise (obtained via the “kernel method”) that the generating functions of the moments of the area are algebraic functions, expressible as symmetric functions in terms of the roots of the kernel. For a large class of walks, we give full asymptotics...
متن کامل